Size Competitive Meshing Without Large Angles
نویسندگان
چکیده
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all angles smaller than 170◦. The output triangulation has competitive size with any optimal size mesh having equally bounded largest angle. The competitive ratio is O(log(L/s)) where L and s are respectively the largest and smallest features in the input. OSM runs in O(n log(L/s) +m) time/work where n is the input size and m is the output size. The algorithm first uses Sparse Voronoi Refinement to compute a quality overlay mesh of the input points alone. This triangulation is then combined with the input edges to give the final mesh.
منابع مشابه
Runtime-Efficient Meshing for Piecewise-Linear Complexes
We present a new meshing algorithm to mesh an arbitrary piecewise-linear complex in three dimensions. The algorithm achieves an O(n log ∆ + m) runtime where n, m, and ∆ are the input size, the output size, and spread respectively. This runtime represents the first non-trivial runtime guarantee for this class of input. The new algorithm extends prior work on runtime-efficient meshing by allowing...
متن کاملDelaunay refinement algorithms for triangular mesh generation
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive f...
متن کاملFast Meshing for Acute PLCs
We present a new algorithm to mesh an arbitrary piecewise linear complex in three dimensions. The algorithm achieves an O(n log∆ + m) runtime where n, m, and ∆ are the input size, the output size, and spread respectively. This represents the first non-trivial runtime guarantee for this class of input. The new algorithm extends prior work on runtime-efficient meshing by allowing the input to hav...
متن کاملDiamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing
We describe a family of quadrilateral meshes based on diamonds, rhombi with 60◦ and 120◦ angles, and kites with 60◦, 90◦, and 120◦ angles, that can be adapted to a local size function by local subdivision operations. The vertices of our meshes form the centers of the circles in a pair of dual circle packings in which each tangency between two circles is crossed orthogonally by a tangency betwee...
متن کاملAll-Hex Meshing of Multiple-Region Domains without Cleanup.
In this paper, we present a new algorithm for all-hex meshing of domains with multiple regions without post-processing cleanup. Our method starts with a strongly balanced octree. In contrast to snapping the grid points onto the geometric boundaries, we move points a slight distance away from the common boundaries. Then we intersect the moved grid with the geometry. This allows us to avoid creat...
متن کامل